A Nash-type Dimensionality Reduction for Discrete Subsets of L2
نویسندگان
چکیده
Pursuing a line of work begun by Whitney, Nash showed that every C manifold of dimension d can be embedded in R in such a manner that the local structure at each point is preserved isometrically. We provide an analog of this result for discrete subsets of Euclidean space. For perfect preservation of infinitesimal neighborhoods we substitute near-isometric embedding of neighborhoods of bounded cardinality. There are a variety of empirical situations, abstracted to metric space tasks, in which small distances are meaningful and reliable, but larger ones are not. Such situations arise in source coding, image processing, computational biology, and other applications, and are the motivation for widely-used heuristics such as Isomap and Locally Linear Embedding. In such situations we offer the possibility of dimension reductions unobtainable with global methods, because the dimension of our locally (1 + )-distorting embedding is proportional to −2 log k, where k is the cardinality of the neighborhoods where distances are preserved and is independent of the number of points in the metric space. One may view our work as a local version of the widely-used Johnson-Lindenstrauss lemma. We use a device of Nash, together with more recent metric embedding methods, to compose local dimensionality reducing embeddings within a global immersion (that preserves short distances), and with mild additional assumptions, a global embedding that also keeps distant points well-separated. We provide an efficient randomized algorithm for the embeddings. ∗[email protected]. School of Engineering and Computer Science, Hebrew University, Israel and Center for the Mathematics of Information, Caltech, CA, USA. Supported in part by a grant from the Israeli Science Foundation (195/02) and in part by a grant from the National Science Foundation (NSF CCF-065253). †[email protected]. Center for the Mathematics of Information, Caltech, Pasadena, CA 91125. ‡[email protected]. Caltech, Pasadena, CA 91125. Supported in part by NSA H98230-06-1-0074 and NSF CCF0515342.
منابع مشابه
Impact of linear dimensionality reduction methods on the performance of anomaly detection algorithms in hyperspectral images
Anomaly Detection (AD) has recently become an important application of hyperspectral images analysis. The goal of these algorithms is to find the objects in the image scene which are anomalous in comparison to their surrounding background. One way to improve the performance and runtime of these algorithms is to use Dimensionality Reduction (DR) techniques. This paper evaluates the effect of thr...
متن کامل2D Dimensionality Reduction Methods without Loss
In this paper, several two-dimensional extensions of principal component analysis (PCA) and linear discriminant analysis (LDA) techniques has been applied in a lossless dimensionality reduction framework, for face recognition application. In this framework, the benefits of dimensionality reduction were used to improve the performance of its predictive model, which was a support vector machine (...
متن کاملA Monte Carlo-Based Search Strategy for Dimensionality Reduction in Performance Tuning Parameters
Redundant and irrelevant features in high dimensional data increase the complexity in underlying mathematical models. It is necessary to conduct pre-processing steps that search for the most relevant features in order to reduce the dimensionality of the data. This study made use of a meta-heuristic search approach which uses lightweight random simulations to balance between the exploitation of ...
متن کاملEfficient prediction of x-axis intercepts of discrete impedance spectra
In impedance spectroscopy of epithelial cell layers, it is a common task to extrapolate discrete two-dimensional plots in order to determine electrical properties associated with axis intercepts. Here, we investigate how implicit properties of such curves can be used to predict the x-axis intercept where explicitly determined properties fail to do so. We perform feature extraction, algorithmic ...
متن کاملانجام یک مرحله پیش پردازش قبل از مرحله استخراج ویژگی در طبقه بندی داده های تصاویر ابر طیفی
Hyperspectral data potentially contain more information than multispectral data because of their higher spectral resolution. However, the stochastic data analysis approaches that have been successfully applied to multispectral data are not as effective for hyperspectral data as well. Various investigations indicate that the key problem that causes poor performance in the stochastic approaches t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2008